Shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications

ABSTRACT

A processor of an apparatus establishes a wireless communication link with at least one other apparatus via a transceiver of the apparatus. The processor wirelessly communicates with the other apparatus via the wireless communication link by: selecting a first shift-coefficient table from a plurality of shift-coefficient tables; generating a QC-LDPC code using a base matrix and at least a portion of the first shift-coefficient table; selecting a codebook from a plurality of codebooks embedded in the QC-LDPC code; storing the selected codebook in a memory associated with the processor; encoding data using the selected codebook to generate a plurality of modulation symbols of the data; and controlling the transceiver to multiplex, convert, filter, amplify and radiate the modulation symbols as electromagnetic waves through one or more antennas of the apparatus to transmit the modulation symbols of the data to the other apparatus via the wireless communication link.

CROSS REFERENCE TO RELATED PATENT APPLICATIONS

The present disclosure claims the priority benefit of U.S. Provisional Patent Application No. 62/525,797, filed 28 Jun. 2017, and is part of a continuation-in-part (CIP) application of U.S. patent application Ser. No. 15/594,239, filed 12 May 2017. Contents of the aforementioned patent documents are herein incorporated by reference in their entirety.

TECHNICAL FIELD

The present disclosure is generally related to mobile communications and, more particularly, to shift-coefficient table design of quasi-cyclic low-density parity-check (QC-LDPC) code for larger code block sizes in mobile communications.

BACKGROUND

Unless otherwise indicated herein, approaches described in this section are not prior art to the claims listed below and are not admitted as prior art by inclusion in this section.

The 3^(rd) Generation Partnership Project (3GPP) has approved plans to speed up the development of the 5th-generation (5G) New Radio (NR) specifications, it thus can be expected that standards-based 5G NR wireless communications services can be launched in the near future. The 3GPP has also agreed that QC-LDPC will be used for in 5G NR data channel. However, specifics regarding how QC-LDPC-based coding (e.g., encoding and decoding) can be implemented are not yet defined.

SUMMARY

The following summary is illustrative only and is not intended to be limiting in any way. That is, the following summary is provided to introduce concepts, highlights, benefits and advantages of the novel and non-obvious techniques described herein. Select implementations are further described below in the detailed description. Thus, the following summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining the scope of the claimed subject matter.

In one aspect, a method of wireless communication may involve a processor of an apparatus establishing a wireless communication link with at least one other apparatus via a transceiver of the apparatus. The method may also involve the processor wirelessly communicating with the other apparatus via the wireless communication link by: (a) selecting a first shift-coefficient table from a plurality of shift-coefficient tables; (b) generating a QC-LDPC code using a base matrix and at least a portion of the first shift-coefficient table; (c) selecting a codebook from a plurality of codebooks embedded in the QC-LDPC code; (d) storing the selected codebook in a memory associated with the processor; (e) encoding data using the selected codebook to generate a plurality of modulation symbols of the data; and (f) controlling the transceiver to multiplex, convert, filter, amplify and radiate the modulation symbols as electromagnetic waves through one or more antennas of the apparatus to transmit the modulation symbols of the data to the other apparatus via the wireless communication link. In selecting the first shift-coefficient table from the plurality of shift-coefficient tables, the method may involve the processor selecting the first shift-coefficient table according to one or more rules related to either or both of a code block size and a code rate of the data for relatively larger code block sizes.

It is noteworthy that, although description of the proposed scheme and various examples is provided below in the context of 5G NR wireless communications, the proposed concepts, schemes and any variation(s)/derivative(s) thereof may be implemented in communications in accordance with other protocols, standards and specifications where implementation is suitable. Thus, the scope of the proposed scheme is not limited to the description provided herein.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of the present disclosure. The drawings illustrate implementations of the disclosure and, together with the description, serve to explain the principles of the disclosure. It is appreciable that the drawings are not necessarily in scale as some components may be shown to be out of proportion than the size in actual implementation in order to clearly illustrate the concept of the present disclosure.

FIG. 1 is a diagram of an example multi-codebook-embedded LDPC code design in accordance with an implementation of the present disclosure.

FIG. 2 is a diagram of an example logic flow related to multi-codebook-embedded LDPC code design in accordance with an implementation of the present disclosure.

FIG. 3 is a diagram of an example quasi-row orthogonal layer design in accordance with an implementation of the present disclosure.

FIG. 4 is a diagram of an example hybrid orthogonality layer design in accordance with an implementation of the present disclosure.

FIG. 5 is a diagram of an example QC-LDPC code that supports extreme low code rate in accordance with an implementation of the present disclosure.

FIG. 6 is a diagram of an example kernel matrix design in accordance with an implementation of the present disclosure.

FIG. 7 is a diagram of an example concept of kernel base matrix in accordance with an implementation of the present disclosure.

FIG. 8 is a diagram of an example concept of kernel base matrix in accordance with another implementation of the present disclosure.

FIG. 9 is a diagram of an example shift-coefficient design in accordance with an implementation of the present disclosure.

FIG. 10 is a block diagram of an example communications system in accordance with an implementation of the present disclosure.

FIG. 11 is a flowchart of an example process in accordance with an implementation of the present disclosure.

FIG. 12 is a flowchart of an example process in accordance with another implementation of the present disclosure.

FIG. 13 is a flowchart of an example process in accordance with another implementation of the present disclosure.

FIG. 14 is a flowchart of an example process in accordance with another implementation of the present disclosure.

Each of FIG. 15(A) and FIG. 15(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

Each of FIG. 16(A) and FIG. 16(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

Each of FIG. 17(A) and FIG. 17(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

Each of FIG. 18(A) and FIG. 18(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

Each of FIG. 19(A) and FIG. 19(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

Each of FIG. 20(A) and FIG. 20(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

Each of FIG. 21(A) and FIG. 21(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

Each of FIG. 22(A) and FIG. 22(B) is a diagram of a portion of an example shift-coefficient table in accordance with an implementation of the present disclosure.

FIG. 23 is a diagram of an example logic flow related to selection of shift-coefficient tables in accordance with an implementation of the present disclosure.

FIG. 24 is a flowchart of an example process in accordance with another implementation of the present disclosure.

DETAILED DESCRIPTION OF PREFERRED IMPLEMENTATIONS

Detailed embodiments and implementations of the claimed subject matters are disclosed herein. However, it shall be understood that the disclosed embodiments and implementations are merely illustrative of the claimed subject matters which may be embodied in various forms. The present disclosure may, however, be embodied in many different forms and should not be construed as limited to the exemplary embodiments and implementations set forth herein. Rather, these exemplary embodiments and implementations are provided so that description of the present disclosure is thorough and complete and will fully convey the scope of the present disclosure to those skilled in the art. In the description below, details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the presented embodiments and implementations.

Overview

The proposed concepts and schemes generally relate to the following areas: multi-codebook-embedded LDPC code design, hybrid orthogonal LDPC layer design, QC-LDPC support of extreme low code rate (CR), kernel matrix design, and shift-coefficient design. The area of hybrid orthogonal LDPC layer design includes the novel concepts and schemes of quasi-row orthogonal layer design and hybrid orthogonality layer design. Description of the proposed concepts and schemes is provided below with reference to FIG. 1-FIG. 9.

FIG. 1 illustrates an example multi-codebook-embedded LDPC code design in accordance with an implementation of the present disclosure. Referring to FIG. 1, a base parity check matrix (herein interchangeably referred as “base matrix”) 100 of a QC-LDPC code in accordance with the present disclosure may have a plurality of codebooks embedded therein.

As shown in FIG. 1, base matrix 100 may include a parity matrix of a plurality of parity bits and an information matrix of a plurality of information bits. In other words, base matrix 100 may be defined by the parity matrix and the information matrix, with the parity matrix having relatively few non-zero/non-null bits (each represented by “1” in FIG. 1) and mostly zero/null bits (each represented by “0” in FIG. 1). The parity matrix may also define a set of linear constraints on code bits. Accordingly, each codebook of the plurality of codebooks embedded in the QC-LDPC code of base matrix 100 may include the parity matrix and a respective portion of the information matrix of a corresponding size such that sizes of the plurality of codebooks are different from one another. Thus, regardless of the size, each codebook may constitute at least a portion of the base matrix. In the example shown in FIG. 1, a codebook may be expressed as follows: Codebook=(I1 or I2 or I3)+P

The notation “I1” represents a first portion of the information matrix, the notation “I2” represents a second portion of the information matrix, the notation “I3” represents a third portion of the information matrix, and the notation “P” represents the parity matrix. Here, a size (e.g., in terms of number of bits and/or memory size) of I1 is greater than a size of I2, which is greater than the size of I3.

Thus, the size of the resultant codebook may vary, depending on the size of the portion of the information matrix that is utilized in combination with the parity matrix to form the codebook. It is noteworthy that, although the example shown in FIG. 1 depicts three codebooks of different sizes due to the combinations of I1+P, I2+P and I3+P, the number of codebooks of different sizes is not limited to three (and may be fewer or more than three) in various implementations in accordance with the present disclosure.

In some implementations, each codebook of the plurality of codebooks may correspond to a respective hybrid automatic repeat request (HARQ) threads of a plurality of HARQ threads that are different from one another. For instance, a first codebook may correspond to a first HARQ thread with a value in the range of 0.33˜0.89. A second codebook may correspond to a second HARQ thread with a value in the range of 0.2˜0.66. A third codebook may correspond to a third HARQ thread with a small code block size less than 400. Thus, in a HARQ-based communication between two communication devices, each HARQ thread of multiple HARQ threads may be correlated or otherwise associated to a respective codebook of multiple codebooks. Then, a HARQ thread that is currently utilized in the HARQ-based communication may be identified. Accordingly, one of the codebooks that corresponds to the identified HARQ thread may be selected for encoding data for transmission.

In some implementations, each codebook of the plurality of codebooks may correspond to a respective memory size (Kb) of one or more registers, one or more buffers, one or more caches and/or one or more memory cells utilized in storing the codebook. For instance, a first codebook may correspond to a first memory size Kb=16. A second codebook may correspond to a second memory size Kb=12. A third codebook may correspond to a third memory size Kb=5. Under a proposed scheme in accordance with the present disclosure, unless a larger codebook corresponding to a larger size of memory is necessary for the encoding (e.g., due to a code block size of the data to be encoded being relatively large or due to an initial code rate being relatively high), a small codebook corresponding to a small size of memory may be selected for encoding. Thus, usage of memory space larger than necessary (due to a codebook larger than necessary being selected) may be avoided, thereby shortening the processing latency for encoding.

In some implementations, all codebooks may share one base matrix with different zero-padding sizes. In some implementations, different codebooks may correspond to different shift-coefficient designs or share one shift-coefficient design.

In some implementations, the selection of which codebook of the multiple codebooks to use may be based on an initial code rate for transmission of the data, a code block size of the data, or both. In some implementations, to shorten the processing latency for encoding in a communication device, the codebook may be selected such that a small codebook requiring a shorter amount of processing latency for the encoding is selected for the encoding unless a larger codebook corresponding to a larger amount of processing latency for the encoding is necessary for the encoding.

FIG. 2 illustrates an example logic flow 200 related to multi-codebook-embedded LDPC code design in accordance with an implementation of the present disclosure. Logic flow 200 may be implemented in or by an encoder or a processor to effect various features and/or aspects of the proposed concepts and schemes of the present disclosure. More specifically, logic flow 200 may involve one or more rules utilized in selection of a codebook from a number of codebooks embedded in a base matrix of a QC-LDPC code such that a small codebook requiring a shorter amount of processing latency for the encoding is selected for the encoding unless a larger codebook corresponding to a larger amount of processing latency for the encoding is necessary for the encoding. Logic flow 200 may include one or more operations, actions, or functions as represented by one or more of blocks 210, 220, 230, 240 and 250. Although illustrated as discrete blocks, various blocks of logic flow 200 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Logic flow 200 may be implemented by each of first apparatus 1005 and second apparatus 1050 described below. Solely for illustrative purposes and without limiting the scope, description of logic flow 200 is provided below in the context of second apparatus 1050. Logic flow 200 may begin at 210.

At 210, logic flow 200 may involve second apparatus 1050 determining whether a code block size of data to be encoded is less than a threshold code block size. In an event that the code block size of the data is determined to be less than the threshold code block size, logic flow 200 may proceed from 210 to 220. In an event that the code block size of the data is determined to be not less than the threshold code block size, logic flow 200 may proceed from 210 to 230.

At 220, logic flow 200 may involve second apparatus 1050 selecting a first codebook of the plurality of codebooks.

At 230, logic flow 200 may involve second apparatus 1050 determining whether an initial code rate for transmission of the data is greater than a threshold code rate. In an event that the initial code rate is determined to be not greater than the threshold code rate, logic flow 200 may proceed from 230 to 240. In an event that the initial code rate is determined to be greater than the threshold code rate, logic flow 200 may proceed from 230 to 250.

At 240, logic flow 200 may involve second apparatus 1050 selecting a second codebook of the plurality of codebooks.

At 250, logic flow 200 may involve second apparatus 1050 selecting a third codebook of the plurality of codebooks.

Here, a size of the third codebook is larger than a size of the second codebook. Additionally, the size of the second codebook is larger than a size of the first codebook. Thus, unless a larger codebook corresponding to a larger size of memory is necessary for the encoding (e.g., the code block size is greater than the threshold code block size or the initial code rate is greater than the threshold code rate), logic flow 200 would select a small codebook corresponding to a small size of memory, thereby minimizing the amount or size of memory utilized to store the selected codebook. That is, logic flow 200 may help shorten the processing latency for encoding.

FIG. 3 illustrates an example quasi-row orthogonal layer design 300 in accordance with an implementation of the present disclosure. Orthogonality is good for LDPC decoder throughput efficiency. In the LDPC code, several rows may be grouped together to form a layer and each column within the layer may be of degree one or zero (i.e., orthogonal). In such cases the layer is referred as a pure-row orthogonal layer.

Referring to FIG. 3, in quasi-row orthogonal layer design 300, several rows may be grouped together to form a quasi-row orthogonal layer, such as Layer 1, Layer 2, Layer 3 and Layer 4 as shown in FIG. 3. In this example, each column within each of Layer 1, Layer 2, Layer 3 and Layer 4 may be of degree one or zero (i.e., orthogonal) with the exception of one or more punctured columns. In the example shown in part (A) of FIG. 3, the two leftmost columns are punctured columns. Each of the other columns in each of Layer 1, Layer 2, Layer 3 and Layer 4 is of degree one or zero (i.e., with one or zero non-zero/non-null bit as represented by “1” and other bits being zero/null as represented by “0”). Advantageously, quasi-row orthogonal layer design 300 provides orthogonality that helps improve the efficiency in decoder throughput.

Moreover, in quasi-row orthogonal layer design 300, there is no cycle within the punctured columns in the quasi-row orthogonal layer. In the example shown in part (B) of FIG. 3, as a cycle exists within the two punctured columns, the corresponding layer is not considered as a quasi-row orthogonal layer in accordance with the present disclosure.

FIG. 4 illustrates an example hybrid orthogonality layer design 400 in accordance with an implementation of the present disclosure. In hybrid orthogonality layer design 400, a QC-LDPC code may include a plurality of portions of different degrees of orthogonality. In the example shown in FIG. 4, blocks of darker color represent bits of 1 while blocks of lighter color represent bits of 0. For instance, a first portion of the plurality of portions may be of a low degree of orthogonality and may correspond to a high code rate. Likewise, a second portion of the plurality of portions may be of a medium degree of orthogonality and may correspond to a medium code rate. Similarly, a third portion of the plurality of portions may be of a high degree of orthogonality and may correspond to a low code rate.

In the example shown in FIG. 4, the plurality of portions of different degrees of orthogonality include the following: (1) a non-row orthogonal portion including a plurality of rows and a plurality of columns that form at least one non-row orthogonal layer corresponding to relatively higher code rate(s), (2) a quasi-row orthogonal portion including a plurality of rows and a plurality of columns that form the at least one quasi-row orthogonal layer corresponding to medium code rate(s), and (3) a pure-row orthogonal portion including a plurality of rows and a plurality of columns that form at least one pure-row orthogonal layer corresponding to relatively lower code rate(s). Here, each column of the plurality of columns of the non-row orthogonal portion is a column of degree two or more. Additionally, one or more columns of the plurality of columns of the quasi-row orthogonal portion include punctured columns of degree two or more. Moreover, the remaining columns of the plurality of columns of the quasi-row orthogonal portion may include non-punctured columns of degree one or zero. Furthermore, each column of the plurality of columns of the pure-row orthogonal portion includes a column of degree one or zero.

FIG. 5 illustrates an example QC-LDPC code 500 that supports extreme low code rate in accordance with an implementation of the present disclosure. Referring to FIG. 5, QC-LDPC code 500 may include a parity matrix of a plurality of parity bits and an information matrix of a plurality of information bits. The information matrix may include one or more rows of bits each of degree two. Moreover, each bit of bits of the degree two of the one or more rows of bits of degree two may be a previously-used parity bit or a previously-transmitted information bit. Furthermore, for extreme low code rates, one or more previous transmissions may be repeated. Accordingly, an extended row may have a weight of two. Node split may be checked for rows with large weight.

FIG. 6 illustrates an example kernel matrix design 600 in accordance with an implementation of the present disclosure. Referring to FIG. 6, in kernel matrix design 600, a QC-LDPC code may include a base matrix with a portion of forming a kernel matrix that corresponds to a code rate of at least a threshold value. For instance, in the example shown in FIG. 6, the kernel matrix supports a code rate of 0.89.

FIG. 7 illustrates an example concept 700 of kernel base matrix in accordance with an implementation of the present disclosure. Referring to FIG. 7, the kernel matrix may include a plurality of rows and a plurality of columns of bits, with two or more of the columns being punctured columns having a specific pattern of bits (e.g., one or more bits of 0). In some implementations, the specific pattern of bits in the punctured columns may include an isosceles right triangle of bits of 0, with a right angle of the triangle corresponding to a bit of 0 at an upper-left corner of the punctured columns.

The kernel matrix may include a parity matrix of a plurality of rows and a plurality of columns of bits. The kernel matrix may also include an information matrix of a plurality of rows and a plurality of columns of bits. The parity matrix may include a matrix having a Wi-Fi pattern (e.g., Wi-Fi like parity matrix). Moreover, more than one rows of bits of the information matrix may include rows of high density of bits of 1 with no or one bit of 0. A bottom row of bits of the plurality of rows may include a first number of bits of 1. The first number may be equal to or greater than a number of punctured columns by 1.

In the example shown in part (A) of FIG. 7, the first several rows (e.g., three rows) are composed of Wi-Fi like parity matrix, and the information matrix has very high density of bits of 1. Specifically, each row in the information matrix includes mostly, if not all, bits of 1 with none or one bit of 0. The punctured columns include a specific pattern of one or more bits of 0 after any number of column permutation(s) and/or row permutation(s) (e.g., at least one column permutation, at least one row permutation, or any combination thereof). The bottom row may have three or four edge blocks. One edge block may correspond to parity variable node (VN) block. Two edge blocks may correspond to the two punctured columns (e.g., VN0 and VN1). In cases where there are four edge blocks, the fourth edge block may be added to increaser the minimum distance.

In the example shown in part (B) of FIG. 7, an example pattern of the punctured column is shown. For a base matrix of size m×n (m rows by n columns) and assuming a number of p columns is/are punctured, a m×p matrix may be constructed with an isosceles right triangle of bits of 0, with a right angle of the triangle corresponding to a bit of 0 at an upper-left corner of the punctured columns. Other bits in the punctured column(s) may be randomly selected to be 0 or 1. As row permutation and/or column permutation may be performed, the actual location of the specific pattern may be different from the upper-left corner of the puncture column(s).

FIG. 8 illustrates an example concept 800 of kernel base matrix in accordance with another implementation of the present disclosure. In concept 800, the kernel matrix includes a Wi-Fi pattern (or Wi-Fi like parity matrix), punctured columns, and remaining portion of the information matrix. The remaining portion of the information matrix may be designed with one of a number of degree distributions. For instance, the kernel matrix may include five rows of bits and twenty columns of bits. A variable node (VN) degree of the twenty columns of bits may include one of the following: [2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3], [2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3], [2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3], and [2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]. A check node (CN) degree of the five rows of bits may include one of the following: [13, 10, 14, 17, 2], [13, 10, 13, 17, 2], [13, 10, 13, 18, 3], [13, 11, 13, 18, 2], [13, 10, 14, 18, 2], [13, 10, 13, 19, 2], [14, 10, 13, 18, 1], [13, 11, 13, 18, 1], [13, 10, 14, 18, 1], [13, 11, 13, 19, 1], [13, 10, 13, 18, 2], and [13, 10, 13, 18, 1].

FIG. 9 illustrates of an example shift-coefficient design 900 in accordance with an implementation of the present disclosure. For each lifting factor, there may be a table of corresponding shift values. The tables among different lifting factors may be nested designed. In shift-coefficient design 900, a valid set of lifting factors may be defined for use in LDPC encoding. In the example shown in FIG. 9, the valid set of lifting factors includes the following lifting factors of different values: Z=16, Z=24, Z=32, Z=48, Z=64, Z=96, Z=128, Z=192, Z=256 and Z=384. In shift-coefficient design 900, the valid set of lifting factors may be optimized to obtain an optimized set of lifting factors. The number of lifting factors in the optimized set is less than the number of lifting factors in the valid set. The table of shift values designed for the closest and smaller or equal lifting factor within the optimized set may be used. For instance, the table of shift values designed for the lifting factor Z=32 may be shared by the lifting factor Z=48. Similarly, the table of shift values designed for the lifting factor Z=128 may be shared by the lifting factor Z=192.

For illustrative purposes and without limitation, in a LDPC codebook in accordance with the present disclosure, an optimized set of lifting factors (Z) may be defined as four sets with Z∈χ={a×2^(j)} ∀ a∈{9, 11, 13, 15}, j∈{0, 1, 2, 3, 4, 5}. A valid set of lifting factors may also be defined as eight sets with Z∈φ={a×2^(j)} ∀ a∈{9, 10, 11, 12, 13, 14, 15, 16}, j∈{0, 1, 2, 3, 4, 5}. The corresponding shift values may be represented by four shift-coefficient tables which may correspond to shift coefficients of {288, 352, 416, 480}. For any lifting factor of Z=a×2^(j) within the valid set φ, the corresponding shift coefficient may be obtained by p_(z) ^(m,n)=(p^(m,n) mod {circumflex over (Z)})+f(Z), where p^(m,n) is the shift coefficient of the (m,n)th element in the shift-coefficient tables for â×2⁵ where â is the largest value within {9, 11, 13, 15} which is smaller than or equal to a and {circumflex over (Z)}=â×2^(j). Moreover, f(Z) is the perturbation which is a function of Z and may be represented by a table.

The use of lifting factors allows packets of various sizes to be encoded with a relatively small set of base matrices and a relatively small set of lifting factors. For instance, a base matrix of size m×n may be utilized to encode a packet of up to k=n−m information bits to obtain a coded packet or codeword of n code bits. With a lifting factor Z the base matrix may be lifted to generate a lifted parity check matrix of dimension Z·m×Z·n. The lifted parity check matrix may then be utilized to encode a packet of up to Z·k information bits to obtain a codeword of Z·n code bits. Moreover, the use of lifting factors also allows efficient parallel encoding and decoding, thereby improving performance, as well as reduces description complexity for LDPC codes of large sizes.

Shift-Coefficient Table Designs For Larger Code Block Sizes

For illustrative purposes, a number of example shift-coefficient tables for relatively larger code block sizes are shown in FIG. 15(A)˜FIG. 22(B).

Each of FIG. 15(A) and FIG. 15(B) is a diagram of a portion of an example shift-coefficient table 1500 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 1500 is composed of part (A) shown in FIG. 15A and part (B) shown in FIG. 15B. Moreover, shift-coefficient table 1500 may correspond to base graph 1 (BG1) with a primitive element of 7 (a=7) and a lifting factor of 224.

Each of FIG. 16(A) and FIG. 16(B) is a diagram of a portion of an example shift-coefficient table 1600 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 1600 is composed of part (A) shown in FIG. 16A and part (B) shown in FIG. 16B. Moreover, shift-coefficient table 1600 may correspond to BG1 with a primitive element of 15 (a=15) and a lifting factor of 240.

Each of FIG. 17(A) and FIG. 17(B) is a diagram of a portion of an example shift-coefficient table 1700 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 1700 is composed of part (A) shown in FIG. 17A and part (B) shown in FIG. 17B. Moreover, shift-coefficient table 1700 may correspond to BG1 with a primitive element of 9 (a=9) and a lifting factor of 288.

Each of FIG. 18(A) and FIG. 18(B) is a diagram of a portion of an example shift-coefficient table 1800 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 1800 is composed of part (A) shown in FIG. 18A and part (B) shown in FIG. 18B. Moreover, shift-coefficient table 1800 may correspond to BG1 with a primitive element of 5 (a=5) and a lifting factor of 320.

Each of FIG. 19(A) and FIG. 19(B) is a diagram of a portion of an example shift-coefficient table 1900 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 1900 is composed of part (A) shown in FIG. 19A and part (B) shown in FIG. 19B. Moreover, shift-coefficient table 1900 may correspond to BG1 with a primitive element of 11 (a=11) and a lifting factor of 352.

Each of FIG. 20(A) and FIG. 20(B) is a diagram of a portion of an example shift-coefficient table 2000 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 2000 is composed of part (A) shown in FIG. 20A and part (B) shown in FIG. 20B. Moreover, shift-coefficient table 2000 may correspond to BG1 with a primitive element of 3 (a=3) and a lifting factor of 384.

Each of FIG. 21(A) and FIG. 21(B) is a diagram of a portion of an example shift-coefficient table 2100 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 2100 is composed of part (A) shown in FIG. 21A and part (B) shown in FIG. 21B. Moreover, shift-coefficient table 2100 may correspond to BG1 with a primitive element of 13 (a=13) and a lifting factor of 208.

Each of FIG. 22(A) and FIG. 22(B) is a diagram of a portion of an example shift-coefficient table 2200 in accordance with an implementation of the present disclosure. Specifically, shift-coefficient table 2200 is composed of part (A) shown in FIG. 22A and part (B) shown in FIG. 22B. Moreover, shift-coefficient table 2200 may correspond to BG1 with a primitive element of 2 (a=2) and a lifting factor of 256.

FIG. 23 illustrates an example logic flow 2300 related to selection of shift-coefficient tables in accordance with an implementation of the present disclosure. Logic flow 2300 may be implemented in or by an encoder or a processor to effect various features and/or aspects of the proposed concepts and schemes of the present disclosure. More specifically, logic flow 2300 may involve one or more rules utilized in selection of a shift-coefficient table from a number of shift-coefficient tables such that a shift-coefficient table suitable for data of a relatively large code block size is selected. Logic flow 2300 may include one or more operations, actions, or functions as represented by one or more of blocks 2310, 2320, 2330 and 2340. Although illustrated as discrete blocks, various blocks of logic flow 2300 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Logic flow 2300 may be implemented by each of first apparatus 1005 and second apparatus 1050 described below. Solely for illustrative purposes and without limiting the scope, description of logic flow 2300 is provided below in the context of first apparatus 1005. Logic flow 2300 may begin at 2310.

At 2310, logic flow 2300 may involve processor 1010 of first apparatus 1005 determining whether a code block size of data to be encoded is less than or equal to a threshold code block size (e.g., 256). In an event that processor 1010 determines that the code block size of the data is less than or equal to the threshold code block size, logic flow 2300 may proceed from 2310 to 2320. Otherwise, in an event that processor 1010 determines that the code block size of the data is determined is greater than the threshold code block size, logic flow 2300 may proceed from 2310 to 2330.

At 2320, logic flow 2300 may involve processor 1010 determining whether a code rate of data to be encoded is less than or equal to a threshold code rate (e.g., 0.75). In an event that processor 1010 determines that the code rate of the data is less than or equal to the threshold code rate, logic flow 2300 may proceed from 2320 to 2340. Otherwise, in an event that processor 1010 determines that the code rate of the data is determined is greater than the threshold code rate, logic flow 2300 may proceed from 2320 to 2330.

At 2330, logic flow 2300 may involve processor 1010 selecting or otherwise using a shift-coefficient table corresponding to base graph 1 (BG1).

At 2340, logic flow 2300 may involve processor 1010 selecting or otherwise using a shift-coefficient table corresponding to base graph 2 (BG2).

Under a proposed scheme in accordance with the present disclosure, regardless of which shift-coefficient table is selected, a partial portion or a full portion (the entirety) of the selected shift-coefficient table may be used in coding. Moreover, a shift-coefficient table having a value modulo one or more lifting factors the same as the modulo result of any of the shift-coefficient tables shown in FIG. 15(A)˜FIG. 22(B) may be selected or otherwise used, whether partially or in its entirety.

Illustrative Implementations

FIG. 10 illustrates an example communications system 1000 in accordance with an implementation of the present disclosure. Communications systems may include a first apparatus 1005 and a second apparatus 1050, which may be in communications with each other via a communications link 1040. Communications link 1040 may be a wireless link in some implementations. Alternatively, communication link 1040 may be a wired link in some other implementations. In the context of 5G NR communications, communication link 1040 is a wireless communication link such as, for example, a multi-user multiple-input-and-multiple-output (MU-MIMO) communication link. Each of first apparatus 1005 and second apparatus 1050 may perform various functions as a communication device to implement concepts, schemes, techniques, processes and methods described herein pertaining to QC-LDPC coding, including those described with respect to some or all of FIG. 1˜FIG. 9 as well as processes 1100, 1200, 1300, 1400 and 2400 described below. More specifically, each of first apparatus 1005 and second apparatus 1050 may implement various aspects of the proposed concepts and schemes pertaining to multi-codebook-embedded LDPC code design, hybrid orthogonal LDPC layer design, QC-LDPC support of extreme low code rate, base matrix design, kernel matrix design, and shift-coefficient design.

Each of first apparatus 1005 and second apparatus 1050 may be a part of an electronic apparatus which may be a communication device, a computing apparatus, a portable or mobile apparatus, or a wearable apparatus. For instance, first apparatus 1005 may be implemented in a Wi-Fi access point, a smartphone, a smartwatch, a smart bracelet, a smart necklace, a personal digital assistant, or a computing device such as a tablet computer, a laptop computer, a notebook computer, a desktop computer, or a server. Likewise, second apparatus 1050 may be implemented in a Wi-Fi mobile client or station, a smartphone, a smartwatch, a smart bracelet, a smart necklace, a personal digital assistant, or a computing device such as a tablet computer, a laptop computer, a notebook computer, a desktop computer, or a server. Alternatively, each of first apparatus 1005 and second apparatus 1050 may be implemented in the form of one or more integrated-circuit (IC) chips such as, for example and not limited to, one or more single-core processors, one or more multi-core processors, or one or more complex-instruction-set-computing (CISC) processors.

Each of first apparatus 1005 and second apparatus 1050 may include at least some of those components shown in FIG. 10, respectively. For instance, first apparatus 1005 may include at least a processor 1010, and second apparatus 1050 may include at least a processor 1060. Additionally, first apparatus 1005 may include a memory 1020, a transceiver 1030 and one or more antennas (represented by antenna 1036), with transceiver 1030 configured to transmit and receive data wirelessly (e.g., in compliance with one or more 3GPP standards, protocols, specifications and/or any applicable wireless protocols and standards such as 5G NR). Each of memory 1020 and transceiver 1030 may be communicatively and operably coupled to processor 1010. Similarly, second apparatus 1050 may also include a memory 1070, a transceiver 1080 and one or more antennas (represented by antenna 1086), with transceiver 1080 configured to transmit and receive data wirelessly (e.g., in compliance with one or more 3GPP standards, protocols, specifications and/or any applicable wireless protocols and standards such as 5G NR). Each of memory 1070 and transceiver 1080 may be communicatively and operably coupled to processor 1060. Each of first apparatus 1005 and second apparatus 1050 may further include other components (e.g., power system, display device and user interface device), which are not pertinent to the proposed scheme of the present disclosure and, thus, are neither shown in FIG. 10 nor described herein in the interest of simplicity and brevity.

Transceiver 1030 may be configured to communicate wirelessly in a single frequency band or multiple frequency bands. Transceiver 1030 may include a transmitter 1032 capable of transmitting data wirelessly and a receiver 1034 capable of receiving data wirelessly. In some implementations, transceiver 1030 may be capable of transmitting/modulating (via transmitter 1032) and receiving/demodulating (via receiver 1034) data symbols as orthogonal frequency-division multiplexed (OFDM) symbols that are radiated through antenna 1036. Likewise, transceiver 1080 may be configured to communicate wirelessly in a single frequency band or multiple frequency bands. Transceiver 1080 may include a transmitter 1082 capable of transmitting data wirelessly and a receiver 1084 capable of receiving data wirelessly. In some implementations, transceiver 1080 may be capable of transmitting/modulating (via transmitter 1082) and receiving/demodulating (via receiver 1084) data symbols as OFDM symbols that are radiated through antenna 1086.

Each of memory 1020 and memory 1070 may be a storage device configured to store one or more sets of codes, programs and/or instructions and/or data therein. In the example shown in FIG. 10, memory 1020 stores one or more sets of processor-executable instructions 1022 and data 1024 therein, and memory 1070 stores one or more sets of processor-executable instructions 1072 and data 1074 therein. Each of memory 1020 and memory 1070 may be implemented by any suitable technology and may include volatile memory and/or non-volatile memory. For example, each of memory 1020 and memory 1070 may include a type of random access memory (RAM) such as dynamic RAM (DRAM), static RAM (SRAM), thyristor RAM (T-RAM) and/or zero-capacitor RAM (Z-RAM). Alternatively or additionally, memory 520 may include a type of read-only memory (ROM) such as mask ROM, programmable ROM (PROM), erasable programmable ROM (EPROM) and/or electrically erasable programmable ROM (EEPROM). Alternatively or additionally, each of memory 1020 and memory 1070 may include a type of non-volatile random-access memory (NVRAM) such as flash memory, solid-state memory, ferroelectric RAM (FeRAM), magnetoresistive RAM (MRAM) and/or phase-change memory.

In one aspect, each of processor 1010 and processor 1060 may be implemented in the form of one or more single-core processors, one or more multi-core processors, or one or more CISC processors. That is, even though a singular term “a processor” is used herein to refer to each of processor 1010 and processor 1060, each of processor 1010 and processor 1060 may include multiple processors in some implementations and a single processor in other implementations in accordance with the present disclosure. In another aspect, each of processor 1010 and processor 1060 may be implemented in the form of hardware (and, optionally, firmware) with electronic components including, for example and without limitation, one or more transistors, one or more diodes, one or more capacitors, one or more resistors, one or more inductors, one or more memristors and/or one or more varactors that are configured and arranged to achieve specific purposes in accordance with the present disclosure. In other words, in at least some implementations, each of processor 1010 and processor 1060 is a special-purpose machine specifically designed, arranged and configured to perform specific tasks including shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications in accordance with various implementations of the present disclosure.

Processor 1010, as a special-purpose machine, may include non-generic and specially-designed hardware circuits that are designed, arranged and configured to perform specific tasks pertaining to shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications in accordance with various implementations of the present disclosure. In one aspect, processor 1010 may execute the one or more sets of codes, programs and/or instructions 1022 stored in memory 1020 to perform various operations to render shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications in accordance with various implementations of the present disclosure. In another aspect, processor 1010 may include an encoder 1012 and a decoder 1014 that, together, perform specific tasks and functions to render QC-LDPC coding in accordance with various implementations of the present disclosure. For instance, encoder 1012 may be configured to encode data in accordance with various concepts and schemes of the present disclosure. Similarly, decoder 1014 may be configured to decode data in accordance with various concepts and schemes of the present disclosure.

In some implementations, processor 1010 may also include a memory 1016 which may include one or more registers, one or more buffers and/or one or more caches. In some implementations, memory 1016 may be utilized by processor 1016 to store a base matrix of QC-LDPC code, a selected codebook, lifting factor(s) and/or one or more shift-coefficient matrices. For instance, processor 1010 may generate the base matrix and store it in memory 1020 and, upon selection of a codebook from the multiple codebooks embedded in the base matrix, processor 1010 may store the selected codebook in memory 1016. Thus, by selecting a codebook from multiple codebooks embedded in the base matrix in accordance with the one or more rules of logic flow 200, processing latency for encoding may be shortened. Thus, by implementing various schemes in accordance with the present disclosure (e.g., encoding data for transmission by selecting a codebook from a plurality of codebooks embedded in a QC-LDPC code), not only the functioning of processor 1010 is improved (e.g., shorter processing latency) but the underlying technology of data encoding is also improved (e.g., shorter processing latency and improved decoder throughput efficiency).

Processor 1060, as a special-purpose machine, may include non-generic and specially-designed hardware circuits that are designed, arranged and configured to perform specific tasks pertaining to QC-LDPC coding in accordance with various implementations of the present disclosure. In one aspect, processor 1060 may execute the one or more sets of codes, programs and/or instructions 1072 stored in memory 1070 to perform various operations pertaining to QC-LDPC coding in accordance with various implementations of the present disclosure. In another aspect, processor 1060 may include an encoder 1062 and a decoder 1064 that performs specific tasks and functions to render QC-LDPC coding in accordance with various implementations of the present disclosure. For instance, encoder 1062 may be configured to encode data in accordance with various concepts and schemes of the present disclosure. Likewise, decoder 1064 may be configured to decode data in accordance with various concepts and schemes of the present disclosure.

In some implementations, processor 1060 may also include a memory 1066 which may include one or more registers, one or more buffers and/or one or more caches. In some implementations, memory 1066 may be utilized by processor 1066 to store a base matrix of QC-LDPC code, a selected codebook, lifting factor(s) and/or a shift-coefficient matrix. For instance, processor 1060 may generate the base matrix and store it in memory 1070 and, upon selection of a codebook from the multiple codebooks embedded in the base matrix, processor 1060 may store the selected codebook in memory 1066. Thus, by selecting a codebook from multiple codebooks embedded in the base matrix in accordance with the one or more rules of logic flow 200, processing latency for encoding may be shortened.

Each of encoder 1012 and encoder 1062 may be configured with electronic components that operate as an encoding chain to perform a number of operations pertaining to encoding. For instance, the encoding chain in each of encoder 1012 and encoder 1062 may perform the following: bit reordering, tone interleaving, hybrid redundancy version (RV) design, adaptive HARQ buffering, and code block grouping. Each of decoder 1014 and decoder 1064 may be configured to support various code rates of codebooks. The lowest code rate of a codebook supported by each of decoder 1014 and decoder 1064 may depend on the size of the corresponding lifting factor. Under the proposed scheme, an upper limit on the size of a log-likelihood ratio (LLR) memory may be set. As lifting factor(s) may be stored in the LLR memory, the size of the LLR memory may define or otherwise limit how large the size of lifting factors can be. Accordingly, by setting the upper limit on the size of the LLR memory, the maximum size of a lifted parity check matrix generated from a base matrix may be set, thereby setting an upper limit on the size of memory needed to store the lifted parity check matrix. In first apparatus 1005, the LLR memory may be implemented by utilizing one or more registers, one or more buffers, one or more caches and/or one or more memory cells in processor 1010 (e.g., memory 1016) or in memory 1020. In second apparatus 1050, the LLR memory may be implemented by utilizing one or more registers, one or more buffers, one or more caches and/or one or more memory cells in processor 1060 (e.g., memory 1066) or in memory 1070.

In operation, for a forward link on the transmitting (TX) side, encoder 1012 may receive a packet of data from a data source, process the data by performing encoding, interleaving and symbol mapping on the data, and provide modulation symbols of the encoded data. Transmitter 1032 may multiplex the modulation symbols with pilot symbols, perform spatial processing and provide one or more output symbol streams. Transmitter 1032 (which may include one or more transmitters) may also condition the one or more output symbol streams by performing digital-to-analog conversion, filtering, amplification and up-conversion to generate one or more forward link signals that are radiated as electromagnetic waves through one or more antennas of antenna 1036. On the receiving (RX) side, receiver 1084 (which may include one or more receivers) may receive the one or more forward link signals as electromagnetic waves via one or more antennas of antenna 1086. Receiver 1084 may process the received signal(s) by performing filtering, amplification, down-conversion and analog-to-digital conversion to obtain samples. Receiver 1084 may also process the samples to obtain received symbols and perform multiple-input-and-multiple-output (MIMO) detection on the received symbols to provide detected symbols. Decoder 1064 may process the detected symbols by performing symbol de-mapping, deinterleaving and decoding to provide decoded data to a data sink.

Similarly, on a reverse link, encoder 1062 may receive a packet of data from a data source and process the data by performing encoding, interleaving and symbol mapping to provide modulation symbols of the encoded data. Transmitter 1082 may multiplex the modulation symbols with pilot symbols, perform spatial processing and provide one or more output symbol streams. Transmitter 1082 (which may include one or more transmitters) may also condition the one or more output symbol streams by performing digital-to-analog conversion, filtering, amplification and up-conversion to generate one or more reverse link signals that are radiated as electromagnetic waves through one or more antennas of antenna 1086. On the RX side, receiver 1034 (which may include one or more receivers) may receive the one or more reverse link signals as electromagnetic waves via one or more antennas of antenna 1036. Receiver 1034 may process the received signal(s) by performing filtering, amplification, down-conversion and analog-to-digital conversion to obtain samples. Receiver 1034 may also process the samples to obtain received symbols and perform MIMO detection on the received symbols to provide detected symbols. Decoder 1014 may process the detected symbols by performing symbol de-mapping, deinterleaving and decoding to recover the data transmitted by second apparatus 1050.

Processor 1010 may be configured to control or otherwise direct operations of first apparatus 1005. Processor 1060 may be configured to control or otherwise direct operations of first apparatus 1050. Processor 1010 may be capable of determining the size of packets to be transmitted and/or received and, correspondingly, control encoding by encoder 1012 and decoding by decoder 1014, respectively, in accordance with schemes and concepts of the present disclosure. Likewise, processor 1060 may be capable of determining the size of packets to be transmitted and/or received and, correspondingly, control encoding by encoder 1062 and decoding by decoder 1064, respectively, in accordance with schemes and concepts of the present disclosure. For instance, each of processor 1010 and processor 1060 may be configured to select a codebook from multiple codebooks embedded in a base matrix of a QC-LDPC code for encoding such that a small codebook requiring a shorter amount of processing latency for the encoding is selected for the encoding unless a larger codebook corresponding to a larger amount of processing latency for the encoding is necessary for the encoding.

Each of first apparatus 1005 and second apparatus 1050 may be configured to implement each of processes 1100, 1200, 1300, 1400 and 2400 described below. Thus, to avoid redundancy and in the interest of brevity, operations of first apparatus 1005 and second apparatus 1050, as well as processor 1010 and processor 1060, are described below in the context of processes 1100, 1200, 1300, 1400 and 2400. It is noteworthy that, although the description below is provided in the context of first apparatus 1005, the description below is also applicable to second apparatus 1050.

With respect to shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications, processor 1010 of first apparatus 1005 may establish a wireless communication link with second apparatus 1050 via transceiver 1030 of apparatus 1005. Processor 1010 may wirelessly communicate, via transceiver 1030, with second apparatus 1050 via the wireless communication link. In wireless communicating with second apparatus 1050, processor 1010 may perform a number of operations. For instance, processor 1010 may perform the following: (1) selecting a first shift-coefficient table from a plurality of shift-coefficient tables; (2) generating a QC-LDPC code using a base matrix and at least a portion of the first shift-coefficient table; (3) selecting a codebook from a plurality of codebooks embedded in the QC-LDPC code; (4) storing the selected codebook in a memory associated with the processor; (5) encoding data using the selected codebook to generate a plurality of modulation symbols of the data; and (6) controlling transceiver 1030 to multiplex, convert, filter, amplify and radiate the modulation symbols as electromagnetic waves through one or more antennas 1036 of first apparatus 1005 to transmit the modulation symbols of the data to second apparatus 1050 via the wireless communication link.

In some implementations, the first shift-coefficient table may include a basic shift-coefficient table arranged in four rows and twenty-six columns in a pattern as follows:

1 2 3 4 5 6 7 8 9 10 11 12 13 1 73 15 103 49 −1 240 39 −1 −1 15 162 215 164 2 303 −1 294 27 261 161 −1 133 4 80 −1 129 300 3 68 7 80 −1 280 38 227 202 200 71 106 −1 −1 4 220 208 −1 30 197 −1 61 175 79 −1 281 303 253 14 15 16 17 18 19 20 21 22 23 24 25 26 1 133 −1 298 110 −1 113 16 189 32 1 0 −1 −1 2 −1 76 266 72 83 −1 260 1 301 0 0 0 −1 3 295 283 301 −1 184 246 230 276 −1 −1 −1 0 0 4 164 53 −1 44 28 77 −1 319 68 1 −1 −1 0

In some implementations, the first shift-coefficient table may include a shift-coefficient table as shown in FIG. 18A and FIG. 18B.

In some implementations, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 5 (a=5) and a lifting factor of 320. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 7 (a=7) and a lifting factor of 224. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 15 (a=15) and a lifting factor of 240. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 9 (a=9) and a lifting factor of 288. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 11 (a=11) and a lifting factor of 352. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 3 (a=3) and a lifting factor of 384. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 13 (a=13) and a lifting factor of 208. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 2 (a=2) and a lifting factor of 256.

In some implementations, in selecting the first shift-coefficient table from the plurality of shift-coefficient tables processor 1010 may select the first shift-coefficient table according to one or more rules related to either or both of a code block size and a code rate of the data for relatively larger code block sizes.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, processor 1010 may generate the QC-LDPC code using the base matrix and a full portion of the first shift-coefficient table.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, processor 1010 may generate the QC-LDPC code using the base matrix and a partial portion of the first shift-coefficient table.

In some implementations, in selecting the first shift-coefficient table from the plurality of shift-coefficient tables, processor 1010 may select a second shift-coefficient table a value of which modulo one or more lifting factors is same as a modulo result of at least the first shift-coefficient table.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, processor 1010 may generate the QC-LDPC code using the base matrix and a full portion of the second shift-coefficient table.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, processor 1010 may generate the QC-LDPC code using the base matrix and a partial portion of the second shift-coefficient table.

In some implementations, in selecting the first shift-coefficient table from the plurality of shift-coefficient tables, processor 1010 may perform a number of operations (e.g., with respect to logic flow 2300). For instance, processor 1010 may determine whether the code block size is less than or equal to a threshold code block size. Additionally, processor 1010 may determine whether the code rate is less than or equal to a threshold code rate. Moreover, processor 1010 may select the first shift-coefficient table which corresponds to base graph 1 (BG1) responsive to a determination that the code block size is greater than the threshold code block size or responsive to a determination that the code rate is greater than the threshold code rate. Alternatively, processor 1010 may select the first shift-coefficient table which corresponds to base graph 2 (BG2) responsive to a determination that the code block size is less than or equal to the threshold code block size and responsive to a determination that the code rate is less than or equal to the threshold code rate.

In some implementations, each codebook of the plurality of codebooks may correspond to a respective hybrid automatic repeat request (HARQ) threads of a plurality of HARQ threads that are different from one another.

In some implementations, in selecting the codebook from the plurality of codebooks, processor 1010 may perform a number of operations. For instance, processor 1010 may determine whether the code block size of the data is less than the threshold code block size. Additionally, responsive to the code block size of the data being less than the threshold code block size, processor 1010 may select a third codebook of the plurality of codebooks. Moreover, responsive to the code block size of the data being not less than the threshold code block size, processor 1010 may determine whether an initial code rate for transmission of the data is greater than the threshold code rate. Also, responsive to the initial code rate being not greater than the threshold code rate, processor 1010 may select a second codebook of the plurality of codebooks. Furthermore, responsive to the initial code rate being greater than the threshold code rate, processor 1010 may select a first codebook of the plurality of codebooks. A size of the first codebook may be larger than a size of the second codebook, and the size of the second codebook may be larger than a size of the third codebook.

In some implementations, in selecting the codebook from the plurality of codebooks, processor 1010 may perform a number of operations. For instance, processor 1010 may determine the code block size of the data. Additionally, processor 1010 may select the codebook by: (1) selecting a first codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a first threshold code block size; (2) selecting a second codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a second threshold code block size; and (3) selecting a third codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a third threshold code block size. The first threshold code block size may be greater than the second threshold code block size. The second threshold code block size may be greater than the third threshold code block size. A size of the first codebook may be larger than a size of the second codebook, and the size of the second codebook may be larger than a size of the third codebook.

Illustrative Processes

FIG. 11 illustrates an example process 1100 in accordance with an implementation of the present disclosure. Process 1100 may represent an aspect of implementing the proposed concepts and schemes such as those described with respect to some or all of FIG. 1˜FIG. 10. More specifically, process 1100 may represent an aspect of the proposed concepts and schemes pertaining to QC-LDPC coding. Process 1100 may include one or more operations, actions, or functions as illustrated by one or more of blocks 1110, 1120, 1130 and 1140. Although illustrated as discrete blocks, various blocks of process 1100 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks/sub-blocks of process 1100 may be executed in the order shown in FIG. 11 or, alternatively in a different order. Process 1100 may be implemented by communications system 1000 and any variations thereof. For instance, process 1100 may be implemented in or by first apparatus 1005 and/or second apparatus 1050. Solely for illustrative purposes and without limiting the scope, process 1100 is described below in the context of first apparatus 1005. Process 1100 may begin at block 1110.

At 1110, process 1100 may involve processor 1010 of first apparatus 1005 generating a QC-LDPC code having a plurality of codebooks embedded therein. Process 1100 may proceed from 1110 to 1120.

At 1120, process 1100 may involve processor 1010 selecting a codebook from the plurality of codebooks. Process 1100 may proceed from 1120 to 1130.

At 1130, process 1100 may involve processor 1010 encoding data using the selected codebook. Process 1100 may proceed from 1130 to 1140.

At 1140, process 1100 may involve processor 1010 transmitting, via transceiver 1030, the encoded data (e.g., to second apparatus 1050).

In some implementations, each codebook of the plurality of codebooks may correspond to a respective HARQ threads of a plurality of HARQ threads that are different from one another. For instance, process 1100 may involve processor 1010 communicating with processor 1060 of second apparatus 1050 using HARQ. In selecting the codebook from the plurality of codebooks, process 1100 may involve processor 1010 performing the following: (1) correlating or otherwise associating each HARQ thread of the plurality of HARQ threads to a respective codebook of the plurality of codebooks; (2) identifying a HARQ thread that is currently utilized in communicating with second apparatus 1050; and (3) selecting one of the codebooks that corresponds to the identified HARQ thread. The selected codebook may be utilized in encoding the data to be transmitted to second apparatus 1050.

In some implementations, in generating the QC-LDPC code having the plurality of codebooks embedded therein, process 1100 may involve processor 1010 generating the QC-LDPC code which is composed of a base matrix and one or more shift-coefficient matrices. The base matrix may include a parity matrix of a plurality of parity bits and an information matrix of a plurality of information bits. Each codebook of the plurality of codebooks may include the parity matrix and a respective portion of the information matrix of a corresponding size such that sizes of the plurality of codebooks are different from one another.

In some implementations, each codebook of the plurality of codebooks may correspond to a respective design of a plurality of designs of the shift-coefficient matrix.

In some implementations, in generating the QC-LDPC code having the plurality of codebooks embedded therein, process 1100 may involve processor 1010 generating a respective table of shift values for each lifting factor of a first set of lifting factors. Moreover, process 1100 may involve processor 1010 optimizing the first set of lifting factors to produce a second set of lifting factors. The number of lifting factors of the first set may be greater than a number of lifting factors of the second set. A first lifting factor that exists in the first set but not in the second set may share a respective table of shift values of a second lifting factor that exists in both the first set and the second set. The second lifting factor may be smaller than the first lifting factor in value and closest to the first lifting factor than other lifting factors in the first set.

In some implementations, in selecting the codebook from the plurality of codebooks, process 1100 may involve processor 1010 selecting the codebook from the plurality of codebooks based on an initial code rate for transmission of the data, a code block size of the data, or both.

In some implementations, in selecting the codebook from the plurality of codebooks, process 1100 may involve processor 1010 performing a number of operations (e.g., similar to those involved in logic flow 200). For instance, process 1100 may involve processor 1010 determining whether a code block size of the data is less than a threshold code block size. In response to the code block size of the data being less than the threshold code block size, process 1100 may involve processor 1010 selecting a third codebook of the plurality of codebooks. In response to the code block size of the data being not less than the threshold code block size, process 1100 may involve processor 1010 determining whether an initial code rate for transmission of the data is greater than a threshold code rate. In response to the initial code rate being not greater than the threshold code rate, process 1100 may involve processor 1010 selecting a second codebook of the plurality of codebooks. In response to the initial code rate being greater than the threshold code rate, process 1100 may involve processor 1010 selecting a first codebook of the plurality of codebooks. A size of the first codebook may be larger than a size of the second codebook. The size of the second codebook may be larger than a size of the third codebook.

Alternatively or additionally, in selecting the codebook from the plurality of codebooks, process 1100 may involve processor 1010 performing a number of other operations. For instance, process 1100 may involve processor 1010 determining a code block size of the data. Based on a result of the determination, process 1100 may involve processor 1010 selecting a first codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a first threshold code block size. Additionally, process 1100 may involve processor 1010 selecting a second codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a second threshold code block size. Moreover, process 1100 may involve processor 1010 selecting a third codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a third threshold code block size. The first threshold code block size may be greater than the second threshold code block size. The second threshold code block size may be greater than the third threshold code block size. A size of the first codebook may be larger than a size of the second codebook. The size of the second codebook may be larger than a size of the third codebook.

FIG. 12 illustrates an example process 1200 in accordance with an implementation of the present disclosure. Process 1200 may represent an aspect of implementing the proposed concepts and schemes such as those described with respect to some or all of FIG. 1˜FIG. 10. More specifically, process 1200 may represent an aspect of the proposed concepts and schemes pertaining to hybrid orthogonal LDPC layer design and QC-LDPC support of extreme low code rate. Process 1200 may include one or more operations, actions, or functions as illustrated by one or more of blocks 1210, 1220 and 1230. Although illustrated as discrete blocks, various blocks of process 1200 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks/sub-blocks of process 1200 may be executed in the order shown in FIG. 12 or, alternatively in a different order. Process 1200 may be implemented by communications system 1000 and any variations thereof. For instance, process 1200 may be implemented in or by first apparatus 1005 and/or second apparatus 1050. Solely for illustrative purposes and without limiting the scope, process 1200 is described below in the context of first apparatus 1005. Process 1200 may begin at block 1210.

At 1210, process 1200 may involve processor 1010 of first apparatus 1005 generating a QC-LDPC code that comprises at least one quasi-row orthogonal layer. Process 1200 may proceed from 1210 to 1220.

At 1220, process 1200 may involve processor 1010 encoding data using the QC-LDPC code. Process 1200 may proceed from 1220 to 1230.

At 1230, process 1200 may involve processor 1010 transmitting, via transceiver 1030, the encoded data (e.g., to second apparatus 1050).

In some implementations, the at least one quasi-row orthogonal layer may include a plurality of rows and a plurality of columns of bits. One or more columns of the plurality of columns of the at least one quasi-row orthogonal layer may include at least one punctured column of degree two or more. The remaining columns of the plurality of columns of the at least one quasi-row orthogonal layer may include non-punctured columns of degree one or zero.

In some implementations, there may be no cycle within the punctured columns.

In some implementations, the QC-LDPC code may include a hybrid orthogonality design having a plurality of portions of different degrees of orthogonality. A first portion of the plurality of portions of a low degree of orthogonality may correspond to a high code rate, and a second portion of the plurality of portions of a high degree of orthogonality may correspond to a low code rate.

In some implementations, the plurality of portions of different degrees of orthogonality may include some or all of the following: (1) a non-row orthogonal portion comprising a plurality of rows and a plurality of columns forming at least one non-row orthogonal layer, (2) a quasi-row orthogonal portion comprising a plurality of rows and a plurality of columns forming the at least one quasi-row orthogonal layer, and (3) a pure-row orthogonal portion comprising a plurality of rows and a plurality of columns forming at least one pure-row orthogonal layer. The plurality of columns of the non-row orthogonal portion may include at least one punctured column of degree two or more as well as non-punctured columns of degree one or zero. One or more columns of the plurality of columns of the quasi-row orthogonal portion may include at least one punctured column of degree two or more. The remaining columns of the plurality of columns of the quasi-row orthogonal portion may include non-punctured columns of degree one or zero. Each column of the plurality of columns of the pure-row orthogonal portion may include a column of degree one or zero.

In some implementations, the QC-LDPC code may include a parity matrix of a plurality of parity bits and an information matrix of a plurality of information bits. One or more rows of bits through the information matrix and the parity matrix may include one or more rows of bits each of degree two.

In some implementations, each bit of bits of the degree two of the one or more rows of bits of degree two may include a previously-used parity bit or a previously-transmitted information bit.

FIG. 13 illustrates an example process 1300 in accordance with an implementation of the present disclosure. Process 1300 may represent an aspect of implementing the proposed concepts and schemes such as those described with respect to some or all of FIG. 1˜FIG. 10. More specifically, process 1300 may represent an aspect of the proposed concepts and schemes pertaining to kernel matrix design. Process 1300 may include one or more operations, actions, or functions as illustrated by one or more of blocks 1310, 1320 and 1330. Although illustrated as discrete blocks, various blocks of process 1300 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks/sub-blocks of process 1300 may be executed in the order shown in FIG. 13 or, alternatively in a different order. Process 1300 may be implemented by communications system 1000 and any variations thereof. For instance, process 1300 may be implemented in or by first apparatus 1005 and/or second apparatus 1050. Solely for illustrative purposes and without limiting the scope, process 1300 is described below in the context of first apparatus 1005. Process 1300 may begin at block 1310.

At 1310, process 1300 may involve processor 1010 of first apparatus 1005 generating a QC-LDPC code that including a base matrix a portion of which forming a kernel matrix that corresponds to a code rate of at least a threshold value. Process 1300 may proceed from 1310 to 1320.

At 1320, process 1300 may involve processor 1010 encoding data using the QC-LDPC code. Process 1300 may proceed from 1320 to 1330.

At 1330, process 1300 may involve processor 1010 transmitting, via transceiver 1030, the encoded data (e.g., to second apparatus 1050).

In some implementations, the code rate may be 0.89.

In some implementations, the kernel matrix may include a plurality of rows and a plurality of columns of bits. Two or more of the columns may include punctured columns having a specific pattern of bits.

In some implementations, the specific pattern of bits in the punctured columns may include one or more bits of 0 within the punctured columns after any number of column permutation(s) and/or row permutation(s) (e.g., at least one column permutation, at least one row permutation, or any combination thereof). Two examples of a specific pattern including one or more bits of 0 after column permutation(s) and/or row permutation(s) are shown in part (A) of FIG. 7. In some implementations, the specific pattern of bits in the punctured columns may include an isosceles right triangle of bits of 0, with a right angle of the triangle corresponding to a bit of 0 at an upper-left corner of the punctured columns. An example of such an isosceles right triangle of bits of 0 is shown in part (B) of FIG. 7.

In some implementations, the kernel matrix may include a parity matrix of a plurality of rows and a plurality of columns of bits. The kernel matrix may also include an information matrix of a plurality of rows and a plurality of columns of bits. The parity matrix may include a matrix having a Wi-Fi pattern. More than one rows of bits of the information matrix excluding punctured columns of the kernel matrix may include rows of high density of bits of 1 with no or one bit of 0. The rows of high density bits may correspond to rows of the Wi-Fi pattern.

In some implementations, a bottom row of bits of the plurality of rows may include a first number of bits of 1. The first number may be equal to or greater than a number of punctured columns by zero, one, two or three (e.g., by a few). In some implementations, a portion of the first number of bits of 1 in the bottom row may correspond to the punctured columns and a right-most column of the kernel matrix bordering a right side of the Wi-Fi pattern.

In some implementations, the kernel matrix may include five rows of bits and twenty columns of bits. A variable node degree of the twenty columns of bits may include one of the following: [2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3], [2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3], [2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3], and [2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]. A check node degree of the five rows of bits may include one of the following: [13, 10, 14, 17, 2], [13, 10, 13, 17, 2], [13, 10, 13, 18, 3], [13, 11, 13, 18, 2], [13, 10, 14, 18, 2], [13, 10, 13, 19, 2], [14, 10, 13, 18, 1], [13, 11, 13, 18, 1], [13, 10, 14, 18, 1], [13, 11, 13, 19, 1], [13, 10, 13, 18, 2], and [13, 10, 13, 18, 1].

FIG. 14 illustrates an example process 1400 in accordance with an implementation of the present disclosure. Process 1400 may represent an aspect of implementing the proposed concepts and schemes such as those described with respect to FIG. 9. More specifically, process 1300 may represent an aspect of the proposed concepts and schemes pertaining to shift-coefficient design. Process 1400 may include one or more operations, actions, or functions as illustrated by one or more of blocks 1410, 1420 and 1430 as well as sub-blocks 1412 and 1414. Although illustrated as discrete blocks, various blocks of process 1400 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks/sub-blocks of process 1400 may be executed in the order shown in FIG. 14 or, alternatively in a different order. Process 1400 may be implemented by communications system 1000 and any variations thereof. For instance, process 1400 may be implemented in or by first apparatus 1005 and/or second apparatus 1050. Solely for illustrative purposes and without limiting the scope, process 1400 is described below in the context of first apparatus 1005. Process 1400 may begin at block 1410.

At 1410, process 1400 may involve processor 1010 of first apparatus 1005 generating a QC-LDPC code. Process 1400 may proceed from 1410 to 1420.

At 1420, process 1400 may involve processor 1010 encoding data using the QC-LDPC code. Process 1400 may proceed from 1420 to 1430.

At 1430, process 1400 may involve processor 1010 transmitting, via transceiver 1030, the encoded data (e.g., to second apparatus 1050).

In generating the QC-LDPC code, process 1400 may involve processor 1010 performing a number of operations as represented by sub-blocks 1412 and 1414.

At 1412, process 1400 may involve processor 1010 generating a respective table of shift values for each lifting factor of a first set of lifting factors. Process 1400 may proceed from 1412 to 1414.

At 1414, process 1400 may involve processor 1010 optimizing the first set of lifting factors to produce a second set of lifting factors.

A number of lifting factors of the first set may be greater than a number of lifting factors of the second set. A first lifting factor that exists in the first set but not in the second set may share a respective table of shift values of a second lifting factor that exists in both the first set and the second set. The second lifting factor may be smaller than the first lifting factor in value and closest to the first lifting factor than other lifting factors in the first set.

FIG. 24 illustrates an example process 2400 of wireless communication in accordance with an implementation of the present disclosure. Process 2400 may represent an aspect of implementing the proposed concepts and schemes such as those described with respect to some or all of FIG. 1˜FIG. 10 and FIG. 15(A)˜FIG. 23. More specifically, process 2400 may represent an aspect of the proposed concepts and schemes pertaining to shift-coefficient table design of QC-LDPC code for larger code block sizes in mobile communications. Process 2400 may include one or more operations, actions, or functions as illustrated by one or more of blocks 2410 and 2420 as well as sub-blocks 24202, 24204, 24206, 24208, 24210 and 24212. Although illustrated as discrete blocks, various blocks of process 2400 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks/sub-blocks of process 2400 may be executed in the order shown in FIG. 24 or, alternatively in a different order. Process 2400 may be implemented by communications system 1000 and any variations thereof. For instance, process 2400 may be implemented in or by first apparatus 1005 and/or second apparatus 1050. Solely for illustrative purposes and without limiting the scope, process 2400 is described below in the context of first apparatus 1005, although the same also applies to apparatus 1050. Process 2400 may begin at block 2410.

At 2410, process 2400 may involve processor 1010 of first apparatus 1005 establishing a wireless communication link with at least one other apparatus (e.g., second apparatus 1050) via transceiver 1030 of apparatus 1005. Process 2400 may proceed from 2410 to 2420.

At 2420, process 2400 may involve processor 1010 wirelessly communicating, via transceiver 1030, with the other apparatus via the wireless communication link. In wireless communicating with the other apparatus, process 2400 may involve processor 1010 performing a number of operations as represented by 24202, 24204, 24206, 24208, 24210 and 24212.

At 24202, process 2400 may involve processor 1010 selecting a first shift-coefficient table from a plurality of shift-coefficient tables. Process 2400 may proceed from 24202 to 24204.

At 24204, process 2400 may involve processor 1010 generating a QC-LDPC code using a base matrix and at least a portion of the first shift-coefficient table. Process 2400 may proceed from 24204 to 24206.

At 24206, process 2400 may involve processor 1010 selecting a codebook from a plurality of codebooks embedded in the QC-LDPC code. Process 2400 may proceed from 24206 to 24208.

At 24208, process 2400 may involve processor 1010 storing the selected codebook in a memory associated with the processor. Process 2400 may proceed from 24208 to 24210.

At 24210, process 2400 may involve processor 1010 encoding data using the selected codebook to generate a plurality of modulation symbols of the data. Process 2400 may proceed from 24212 to 24212.

At 24212, process 2400 may involve processor 1010 controlling transceiver 1030 to multiplex, convert, filter, amplify and radiate the modulation symbols as electromagnetic waves through one or more antennas 1036 of first apparatus 1005 to transmit the modulation symbols of the data to the other apparatus via the wireless communication link.

In some implementations, the first shift-coefficient table may include a basic shift-coefficient table arranged in four rows and twenty-six columns in a pattern as follows:

1 2 3 4 5 6 7 8 9 10 11 12 13 1 73 15 103 49 −1 240 39 −1 −1 15 162 215 164 2 303 −1 294 27 261 161 −1 133 4 80 −1 129 300 3 68 7 80 −1 280 38 227 202 200 71 106 −1 −1 4 220 208 −1 30 197 −1 61 175 79 −1 281 303 253 14 15 16 17 18 19 20 21 22 23 24 25 26 1 133 −1 298 110 −1 113 16 189 32 1 0 −1 −1 2 −1 76 266 72 83 −1 260 1 301 0 0 0 −1 3 295 283 301 −1 184 246 230 276 −1 −1 −1 0 0 4 164 53 −1 44 28 77 −1 319 68 1 −1 −1 0

In some implementations, the first shift-coefficient table may include a shift-coefficient table as shown in FIG. 18A and FIG. 18B.

In some implementations, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 5 (a=5) and a lifting factor of 320. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 7 (a=7) and a lifting factor of 224. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 15 (a=15) and a lifting factor of 240. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 9 (a=9) and a lifting factor of 288. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 11 (a=11) and a lifting factor of 352. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 3 (a=3) and a lifting factor of 384. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 13 (a=13) and a lifting factor of 208. Alternatively, the first shift-coefficient table may include a shift-coefficient table corresponding to BG1 with a primitive element of 2 (a=2) and a lifting factor of 256.

In some implementations, in selecting the first shift-coefficient table from the plurality of shift-coefficient tables, process 2400 may involve processor 1010 selecting the first shift-coefficient table according to one or more rules related to either or both of a code block size and a code rate of the data for relatively larger code block sizes.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, process 2400 may involve processor 1010 generating the QC-LDPC code using the base matrix and a full portion of the first shift-coefficient table.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, process 2400 may involve processor 1010 generating the QC-LDPC code using the base matrix and a partial portion of the first shift-coefficient table.

In some implementations, in selecting the first shift-coefficient table from the plurality of shift-coefficient tables, process 2400 may involve processor 1010 selecting a second shift-coefficient table a value of which modulo one or more lifting factors is same as a modulo result of at least the first shift-coefficient table.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, process 2400 may involve processor 1010 generating the QC-LDPC code using the base matrix and a full portion of the second shift-coefficient table.

In some implementations, in generating the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table, process 2400 may involve processor 1010 generating the QC-LDPC code using the base matrix and a partial portion of the second shift-coefficient table.

In some implementations, in selecting the first shift-coefficient table from the plurality of shift-coefficient tables, process 2400 may involve processor 1010 performing a number of operations. For instance, process 2400 may involve processor 1010 determining whether the code block size is less than or equal to a threshold code block size. Additionally, process 2400 may involve processor 1010 determining whether the code rate is less than or equal to a threshold code rate. Moreover, process 2400 may involve processor 1010 selecting the first shift-coefficient table which corresponds to base graph 1 (BG1) responsive to a determination that the code block size is greater than the threshold code block size or responsive to a determination that the code rate is greater than the threshold code rate. Alternatively, process 2400 may involve processor 1010 selecting the first shift-coefficient table which corresponds to base graph 2 (BG2) responsive to a determination that the code block size is less than or equal to the threshold code block size and responsive to a determination that the code rate is less than or equal to the threshold code rate.

In some implementations, each codebook of the plurality of codebooks may correspond to a respective hybrid automatic repeat request (HARQ) threads of a plurality of HARQ threads that are different from one another.

In some implementations, in selecting the codebook from the plurality of codebooks, process 2400 may involve processor 1010 performing a number of operations. For instance, process 2400 may involve processor 1010 determining whether the code block size of the data is less than the threshold code block size. Additionally, process 2400 may involve processor 1010 responsive to the code block size of the data being less than the threshold code block size, selecting a third codebook of the plurality of codebooks. Moreover, responsive to the code block size of the data being not less than the threshold code block size, process 2400 may involve processor 1010 determining whether an initial code rate for transmission of the data is greater than the threshold code rate. Also, responsive to the initial code rate being not greater than the threshold code rate, process 2400 may involve processor 1010 selecting a second codebook of the plurality of codebooks. Furthermore, responsive to the initial code rate being greater than the threshold code rate, process 2400 may involve processor 1010 selecting a first codebook of the plurality of codebooks. A size of the first codebook may be larger than a size of the second codebook, and the size of the second codebook may be larger than a size of the third codebook.

In some implementations, in selecting the codebook from the plurality of codebooks, process 2400 may involve processor 1010 performing a number of operations. For instance, process 2400 may involve processor 1010 determining the code block size of the data. Additionally, process 2400 may involve processor 1010 selecting the codebook by: (1) selecting a first codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a first threshold code block size; (2) selecting a second codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a second threshold code block size; and (3) selecting a third codebook of the plurality of codebooks responsive to the code block size being determined to be greater than a third threshold code block size. The first threshold code block size may be greater than the second threshold code block size. The second threshold code block size may be greater than the third threshold code block size. A size of the first codebook may be larger than a size of the second codebook, and the size of the second codebook may be larger than a size of the third codebook.

Additional Notes

The herein-described subject matter sometimes illustrates different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely examples, and that in fact many other architectures can be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being “operably connected”, or “operably coupled”, to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being “operably couplable”, to each other to achieve the desired functionality. Specific examples of operably couplable include but are not limited to physically mateable and/or physically interacting components and/or wirelessly interactable and/or wirelessly interacting components and/or logically interacting and/or logically interactable components.

Further, with respect to the use of substantially any plural and/or singular terms herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as is appropriate to the context and/or application. The various singular/plural permutations may be expressly set forth herein for sake of clarity.

Moreover, it will be understood by those skilled in the art that, in general, terms used herein, and especially in the appended claims, e.g., bodies of the appended claims, are generally intended as “open” terms, e.g., the term “including” should be interpreted as “including but not limited to,” the term “having” should be interpreted as “having at least,” the term “includes” should be interpreted as “includes but is not limited to,” etc. It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases “at least one” and “one or more” to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim recitation to implementations containing only one such recitation, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an,” e.g., “a” and/or “an” should be interpreted to mean “at least one” or “one or more;” the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number, e.g., the bare recitation of “two recitations,” without other modifiers, means at least two recitations, or two or more recitations. Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc. In those instances where a convention analogous to “at least one of A, B, or C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc. It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B.”

From the foregoing, it will be appreciated that various implementations of the present disclosure have been described herein for purposes of illustration, and that various modifications may be made without departing from the scope and spirit of the present disclosure. Accordingly, the various implementations disclosed herein are not intended to be limiting, with the true scope and spirit being indicated by the following claims. 

What is claimed is:
 1. A method of wireless communication, comprising: establishing, by a processor of an apparatus, a wireless communication link with at least one other apparatus via a transceiver of the apparatus; and wirelessly communicating, by the processor, with the other apparatus via the wireless communication link by: selecting a first shift-coefficient table from a plurality of shift-coefficient tables; generating a quasi-cyclic-low-density parity-check (QC-LDPC) code using a base matrix and at least a portion of the first shift-coefficient table; selecting a codebook from a plurality of codebooks embedded in the QC-LDPC code; storing the selected codebook in a memory associated with the processor; encoding data using the selected codebook to generate a plurality of modulation symbols of the data; and controlling the transceiver to multiplex, convert, filter, amplify and radiate the modulation symbols as electromagnetic waves through one or more antennas of the apparatus to transmit the modulation symbols of the data to the other apparatus via the wireless communication link, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables comprises selecting the first shift-coefficient table according to one or more rules related to either or both of a code block size and a code rate of the data for relatively larger code block sizes.
 2. The method of claim 1, wherein the first shift-coefficient table comprises a basic shift-coefficient table arranged in four rows and twenty-six columns in a pattern as follows: 1 2 3 4 5 6 7 8 9 10 11 12 13 1 73 15 103 49 −1 240 39 −1 −1 15 162 215 164 2 303 −1 294 27 261 161 −1 133 4 80 −1 129 300 3 68 7 80 −1 280 38 227 202 200 71 106 −1 −1 4 220 208 −1 30 197 −1 61 175 79 −1 281 303 253 14 15 16 17 18 19 20 21 22 23 24 25 26 1 133 −1 298 110 −1 113 16 189 32 1 0 −1 −1 2 −1 76 266 72 83 −1 260 1 301 0 0 0 −1 3 295 283 301 −1 184 246 230 276 −1 −1 −1 0 0 4 164 53 −1 44 28 77 −1 319 68 1 −1 −1
 0.


3. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table as shown in FIG. 18A and FIG. 18B.
 4. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 5 (a=5) and a lifting factor of
 320. 5. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 7 (a=7) and a lifting factor of
 224. 6. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 15 (a=15) and a lifting factor of
 240. 7. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 9 (a=9) and a lifting factor of
 288. 8. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 11 (a=11) and a lifting factor of
 352. 9. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 3 (a=3) and a lifting factor of
 384. 10. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 13 (a=13) and a lifting factor of
 208. 11. The method of claim 1, wherein the first shift-coefficient table comprises a shift-coefficient table corresponding to base graph 1 (BG1) with a primitive element of 2 (a=2) and a lifting factor of
 256. 12. The method of claim 1, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a full portion of the first shift-coefficient table.
 13. The method of claim 1, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a partial portion of the first shift-coefficient table.
 14. The method of claim 1, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables comprises selecting a second shift-coefficient table a value of which modulo one or more lifting factors is same as a modulo result of at least the first shift-coefficient table.
 15. The method of claim 14, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a full portion of the second shift-coefficient table.
 16. The method of claim 14, wherein the generating of the QC-LDPC code using the base matrix and at least a portion of the first shift-coefficient table comprises generating the QC-LDPC code using the base matrix and a partial portion of the second shift-coefficient table.
 17. The method of claim 1, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables comprises: determining whether the code block size is less than or equal to a threshold code block size; and determining whether the code rate is less than or equal to a threshold code rate.
 18. The method of claim 17, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables further comprises: selecting the first shift-coefficient table which corresponds to base graph 1 (BG1) responsive to a determination that the code block size is greater than the threshold code block size or responsive to a determination that the code rate is greater than the threshold code rate.
 19. The method of claim 17, wherein the selecting of the first shift-coefficient table from the plurality of shift-coefficient tables further comprises: selecting the first shift-coefficient table which corresponds to base graph 2 (BG2) responsive to a determination that the code block size is less than or equal to the threshold code block size and responsive to a determination that the code rate is less than or equal to the threshold code rate.
 20. The method of claim 1, wherein each codebook of the plurality of codebooks corresponds to a respective hybrid automatic repeat request (HARQ) threads of a plurality of HARQ threads that are different from one another. 